Optimal Implementation of Wait-Free Binary Relations
نویسنده
چکیده
In this article we derive an algorithm for computing the \optimal" wait-free program on two processors that implements a given relation from the semantics of a small atomic read/write shared-memory parallel language. This algorithm is compared with the more general algorithm given in 8, 12] based on the participated set algorithm of 1]. An extension to this is given, where we add a test&set primitive to the previous language. This work is a natural follow up of 6].
منابع مشابه
Randomized Wait-Free Naming
We present new distributed randomized naming protocols improving previous results in renaming and unique processor identity protocols. They are wait-free (which implies maximal fault-tolerance) and allow stronger adversaries. They also have low complexity. We give the rst wait-free protocol achieving optimal key space range. (This is impossible for deterministic wait-free methods, so we use ran...
متن کاملFast Increment Registers
We give an optimal wait free implementation of an increment register An increment register is a concurrent object consisting of an integer valued register with an increment operation that atomically increments the register and returns the previous value We implement this register in a synchronous message passing model with crash failures In our implementation an increment operation halts in O l...
متن کاملOn Utility Accrual Processor Scheduling with Wait-Free Synchronization for Embedded Real-Time Software
We present the first wait-free utility accrual (UA) real-time scheduling algorithms for embedded real-time systems. UA scheduling algorithms allow application activities to be subject to time/utility function (TUF) time constraints, and optimize criteria such as maximizing the sum of the activities’ attained utilities. We present UA algorithms that use wait-free synchronization for mutually exc...
متن کاملEfficient Wait-Free Implementation of a Concurrent Priority Queue
Binary snapshots p. 18 Linear-time snapshot protocols for unbalanced systems p. 26 Towards a necessary and sufficient condition for wait-free synchronization p. 39 Efficient algorithms for checking the atomicity of a run of read and write operations p. 54 Benign failure models for shared memory p. 69 Generalized agreement between concurrent fail-stop processes p. 84 Controlling memory access co...
متن کاملUsing Sticky Bits for Wait-Free Synchronization1
In this paper we consider implementation of atomic wait-free objects in the context of a shared-memory multiprocessor. We introduce a new primitive object, the \Sticky-Bit", and show its universality by proving that any safe implementation of a sequential object can be transformed into a wait-free atomic one using only Sticky Bits and safe registers. The Sticky Bit may be viewed as a memory-ori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997